Design of highly synchronizable and robust networks

In this paper, the design of highly synchronizable, sparse and robust dynamical networks is addressed. Better synchronizability means faster synchronization of the oscillators, sparsity means a low ratio of links per nodes and robustness refers to the resilience of a network to the random failures or intentional removal of some of the nodes/links. Golden spectral dynamical networks (graphs) are those for which the spectral spread (the difference between the largest and smallest eigenvalues of the adjacency matrix) is equal to the spectral gap (the difference between the two largest eigenvalues of the adjacency matrix) multiplied by the square of the golden ratio. These networks display the property of ‘‘small-worldness’’, are very homogeneous and have large isoperimetric (expansion) constant, together with a very high synchronizability and robustness to failures of individual oscillators. In particular, the regular bipartite dynamical networks, reported here by the first time, have the best possible expansion and consequently are the most robust ones against node/link failures or intentional attacks. © 2010 Elsevier Ltd. All rights reserved.